Model Checking Spatial Logics for Closure Spaces

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Model Checking Spatial Logics for Closure Spaces

Spatial aspects of computation are becoming increasingly relevant in Computer Science, especially in the field of collective adaptive systems and when dealing with systems distributed in physical space. Traditional formal verification techniques are well suited to analyse the temporal evolution of programs; however, properties of space are typically not taken into account explicitly. We present...

متن کامل

Model checking Dynamic Epistemic Spatial Logics ∗

We propose a new class of logics for specifying and model-checking properties of distributed systems Dynamic Epistemic Spatial Logics. They have been designed as extensions of Hennessy-Milner logic with spatial operators (inspired by Cardelli-Caires spatial logic) and epistemic operators (inspired by dynamic-epistemic logics). Our logics focus on observers, agents placed in different locations ...

متن کامل

Model Checking for Hybrid Logics

We investigate the complexity of the model checking problem for hybrid logics. We provide model checkers for various hybrid fragments and we prove PSPACEcompleteness for hybrid fragments including binders. We apply our findings to the problems of constraint verification for semistructured data and specification checking for mobile systems.

متن کامل

Model Checking for Combined Logics

F We consider combined model checking procedures for the three ways of combining logics: temporalizations, independent combinations, and the join. We present results on computational complexity and report on experiments with implementations. We also discuss the relevance to time granular logics.

متن کامل

Model Checking Hybrid Logics

We investigate the complexity of the model checking problem for hybrid logics. We provide model checker algorithms for various hybrid fragments and we prove PSPACE-completeness for hybrid fragments including binders. We complement and motivate our complexity results with an application of model checking in hybrid logic to the problems of query and constraint evaluation for semistructured data.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Logical Methods in Computer Science

سال: 2017

ISSN: 1860-5974

DOI: 10.2168/lmcs-12(4:2)2016